directed acyclic graph

directed acyclic graph
abbr. DAG
French\ \ -
German\ \ gerichteter azyklischer Graph
Dutch\ \ -
Italian\ \ -
Spanish\ \ -
Catalan\ \ gràfic dirigit acíclic; GDA
Portuguese\ \ grafo dirigido acíclico
Romanian\ \ -
Danish\ \ rettet acycliske graf
Norwegian\ \ rettet asykliske graf
Swedish\ \ riktad acyklisk graf
Greek\ \ κατευθύνεται άκυκλα γράφημα
Finnish\ \ suunnattu epäsyklinen graafi
Hungarian\ \ irányított aciklikus gráf
Turkish\ \ yönlü çevrimsiz çizge; DAG veya YÇÇ
Estonian\ \ -
Lithuanian\ \ -
Slovenian\ \ usmerjen aciklični graf
Polish\ \ -
Russian\ \ ориентированный ациклический граф; абстрактный тип данных -ориентированный ациклический граф; используемый для отображения произвольных отношений между объектами или классами
Ukrainian\ \ орієнтований ациклічний граф
Serbian\ \ -
Icelandic\ \ beint raðtengdar línurit
Euskara\ \ zuzendu acyclic grafikoa
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ الشكل الموجه بدون دورات DAG
Afrikaans\ \ gerigte asikliese grafiek
Chinese\ \ -
Korean\ \ -

Statistical terms. 2014.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

  • Directed acyclic graph — Graphe acyclique orienté Un exemple de graphe acyclique orienté Dans la théorie des graphes, un graphe acyclique orienté (en anglais directed acyclic graph ou DAG) identifie un graphe qui ne possède pas de cycle, et dont les arcs sont orientés.… …   Wikipédia en Français

  • Propositional directed acyclic graph — A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with op (true),… …   Wikipedia

  • Directed acyclic word graph — For the US Department of Defense review panel, see Deputy’s Advisory Working Group. The strings tap , taps , top , and tops stored in a Trie (left) and a DAWG (right), EOW stands for End of word. In computer science, a directed acyclic word graph …   Wikipedia

  • Acyclic — can refer to: * in chemistry, a compound which is not cyclic, e.g. alkanes and acyclic aliphatic compounds * in mathematics: ** a directed acyclic graph ** a chain complex in which all reduced homology groups are zero …   Wikipedia

  • Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or …   Wikipedia

  • Graph mit Mehrfachkanten — Ein Graph besteht in der Graphentheorie anschaulich aus einer Menge von Punkten, zwischen denen Linien verlaufen. Die Punkte nennt man Knoten oder Ecken, die Linien nennt man meist Kanten, manchmal auch Bögen. Auf die Form der Knoten und Kanten… …   Deutsch Wikipedia

  • Graph ohne Mehrfachkanten — Ein Graph besteht in der Graphentheorie anschaulich aus einer Menge von Punkten, zwischen denen Linien verlaufen. Die Punkte nennt man Knoten oder Ecken, die Linien nennt man meist Kanten, manchmal auch Bögen. Auf die Form der Knoten und Kanten… …   Deutsch Wikipedia

  • Graph-structured stack — In computer science, a graph structured stack is a directed acyclic graph where each directed path is a stack.They are used in parsing to efficiently simulate nondeterminism for ambiguous grammars. In the following diagram, there are four stacks …   Wikipedia

  • directed acyclic word graph — noun A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie). Syn: DAWG …   Wiktionary

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”